Application of Additive Groves to the Learning to Rank Challenge

نویسنده

  • Daria Sorokina
چکیده

This is a description of the team AG submission to the Learning to Rank Challenge. This solution has scored 4th place in the main track. The primary algorithm used is Additive Groves of regression trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive Groves in LTRC Application of Additive Groves to the Learning to Rank Challenge

This paper describes a submission of team AG to the Yahoo! Learning to Rank Challenge held in 2010. This solution has scored 4th place in the main track. The primary algorithm used is Additive Groves of regression trees. 1. Competition and Data Yahoo! Labs organized the first Learning to Rank Challenge in spring 2010. The challenge ran from March 1 to May 31 and received 4, 736 submissions from...

متن کامل

Performance Comparison of Learning to Rank Algorithms for Information Retrieval

Learning to rank is the problem of ranking objects by using machine learning techniques. One of the applications of learning to rank is for ranking document of search results. In this research, we compare the performance of three learning to rank algorithms: RankSVM, LambdaMART, and Additive Groves. RankSVM, which is ranking variant of the classical SVM algorithm, is commonly used as a baseline...

متن کامل

Modeling Additive Structure and Detecting Interactions with Groves of Trees

Discovery of additive structure is an important step towards understanding a complex multi-dimensional function, because it allows for expressing this function as the sum of lower-dimensional or otherwise simpler components. Modeling additive structure also opens up opportunities for learning better regression models. The term statistical interaction is used to describe the presence of non-addi...

متن کامل

Additive Groves with very simple features for brain fibers classification

In this document we describe the entry that came in the third place in the ”Supervised Learning Match Expert” challenge of the ICDM’09 Data Mining Contest. The main method used in our approach is a recently developed tree ensemble algorithm called Additive Groves. Code for Additive Groves is publicly available on the author’s website. 1. Supervised Learning Challenge The data for this competiti...

متن کامل

Application of ensemble learning techniques to model the atmospheric concentration of SO2

In view of pollution prediction modeling, the study adopts homogenous (random forest, bagging, and additive regression) and heterogeneous (voting) ensemble classifiers to predict the atmospheric concentration of Sulphur dioxide. For model validation, results were compared against widely known single base classifiers such as support vector machine, multilayer perceptron, linear regression and re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010